Two Very Simple Microtomes
نویسندگان
چکیده
منابع مشابه
On Very Simple P Colonies
1 Institute of Computer Science Faculty of Philosophy and Science Silesian University in Opava Bezručovo nám. 13, 74601 Opava, Czech Republic {lucie.ciencialova, alica.kelemenova}@fpf.slu.cz 2 Computer and Automation Research Institute Hungarian Academy of Sciences Kende utca 13-17, 1111 Budapest, Hungary {csuhaj, vaszil}@sztaki.hu 3 Department of Algorithms and Their Applications Faculty of In...
متن کاملDestruction of Very Simple Trees
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, d-ary trees, and Cayley trees); these form a subfamily of simply generated trees. At each stage of the process an edge is chose at random from the tree and cut, separating the tree into two components. In the one-sided variant of the process the compo...
متن کاملPartition theory: a very simple illustration.
We illustrate the main features of a recently proposed method based on ensemble density functional theory to divide rigorously a complex molecular system into its parts (J. Phys. Chem. A 2007, 111, 2229). The illustrative system is an analog of the hydrogen molecule for which analytic expressions for the densities of the parts (hydrogen "atoms") are found along with the "partition potential" th...
متن کاملA very simple , re - executable neuroimaging publication
Reproducible research is a key element of the scientific process. Re-executability of neuroimaging workflows that lead to the conclusions arrived at in the literature has not yet been sufficiently addressed and adopted by the neuroimaging community. In this paper, we document a set of procedures, which include supplemental additions to a manuscript, that unambiguously define the data, workflow,...
متن کاملVery Fast and Simple Approximate String Matching
We improve the fastest known algorithm for approximate string matching. This algorithm can only be used for low error levels. By using a new algorithm to verify potential matches and a new optimization technique for biased texts (such as English), the algorithm becomes the fastest one for medium error levels too. This includes most of the interesting cases in this area.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Microscopical Society
سال: 1897
ISSN: 0003-0023
DOI: 10.2307/3221138